The Red Rover Algorithm for Deadlock-Free Routing on Bidirectional Rings
نویسنده
چکیده
An algorithm for deadlock-free routing in bidirectional ring structures in multicomputer networks is presented. This algorithm provides greater throughput and lower message latencies than those of previously presented ring routing algorithms. Insight into these results is given by a message traÆc analysis, and increased performance for wormhole-routed networks is quanti ed through simulation experiments. Additionally, a routing element which implements this algorithm is shown to be simpler and faster than that for a currently-used algorithm.
منابع مشابه
Routing in Bidirectional k-ary n-cubes with the Red Rover Algorithm
The Red Rover algorithm previously presented for deadlock-free routing in rings is applied to bidirectional k-ary n-cube multicomputer networks in this work. This algorithm provides greater throughput and lower message latencies than alternative algorithms in most cases. The increased performance ooered by this algorithm for wormhole-routed networks is quantiied through simulation experiments. ...
متن کاملCAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip
By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...
متن کاملMinimal turn restrictions for designing deadlock-free adaptive routing
A routing algorithm is basically required to be connected and deadlock-fee. We can restrict some directions that messages can turn in a network to avoid deadlock. A deadlock-pee adaptive routing with fewer turn restrictions is considered to possess a greater degree of adaptiveness. We present two basic strategies for designing feasible routings on networks which have bidirectional channels. Pri...
متن کاملAn Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes
The concept af virtual channels is extended to multiple, virtual communication systems that provide adaptability and fault tolerance in addition to being deadlock-free. A channel dependency graph is taken as the definition of what connections are possible and any routing function must use only those connections defined by it. Virtual interconnection networks allowing adaptive, deadlock-free rou...
متن کامل7 Deadlock-free Routing in Ssn
24 electronic LAN, OCI and the bidirectional shuuenet. One important advantage of the last solution (over the previous two) is that it allows the independent choice of the most cost eeective deadlock free routing scheme for each level of the SSN architecture. 8 Conclusions Deadlocks in wormhole routing networks occur when a state is reached such that no messages can be forwarded towards their d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996